Search results for "FSA-Red Algorithm"

showing 4 items of 4 documents

Sequential Mining Classification

2017

Sequential pattern mining is a data mining technique that aims to extract and analyze frequent subsequences from sequences of events or items with time constraint. Sequence data mining was introduced in 1995 with the well-known Apriori algorithm. The algorithm studied the transactions through time, in order to extract frequent patterns from the sequences of products related to a customer. Later, this technique became useful in many applications: DNA researches, medical diagnosis and prevention, telecommunications, etc. GSP, SPAM, SPADE, PrefixSPan and other advanced algorithms followed. View the evolution of data mining techniques based on sequential data, this paper discusses the multiple …

Apriori algorithmComputer sciencebusiness.industryData stream miningConcept mining02 engineering and technologycomputer.software_genreMachine learningGSP AlgorithmTree (data structure)Statistical classificationComputingMethodologies_PATTERNRECOGNITION020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingData miningArtificial intelligencebusinessK-optimal pattern discoverycomputerFSA-Red Algorithm2017 International Conference on Computer and Applications (ICCA)
researchProduct

Hybrid Genetic Algorithms in Data Mining Applications

2009

Genetic algorithms (GAs) are a class of problem solving techniques which have been successfully applied to a wide variety of hard problems (Goldberg, 1989). In spite of conventional GAs are interesting approaches to several problems, in which they are able to obtain very good solutions, there exist cases in which the application of a conventional GA has shown poor results. Poor performance of GAs completely depends on the problem. In general, problems severely constrained or problems with difficult objective functions are hard to be optimized using GAs. Regarding the difficulty of a problem for a GA there is a well established theory. Traditionally, this has been studied for binary encoded …

Fitness functionComputer scienceHybrid genetic algorithmsSimulated annealingGenetic algorithmData miningcomputer.software_genrecomputerTabu searchFSA-Red Algorithm
researchProduct

A novel identification method for generalized T-S fuzzy systems

2012

Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/893807 In order to approximate any nonlinear system, not just affine nonlinear systems, generalized T-S fuzzy systems, where the control variables and the state variables, are all premise variables are introduced in the paper. Firstly, fuzzy spaces and rules were determined by using ant colony algorithm. Secondly, the state-space model parameters are identified by using genetic algorithm. The simulation results show the effectiveness of the proposed algorithm

VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413State variableMathematical optimizationArticle SubjectGeneral MathematicsAnt colony optimization algorithmsPopulation-based incremental learninglcsh:MathematicsVDP::Technology: 500General EngineeringFuzzy control systemlcsh:QA1-939Fuzzy logicNonlinear systemlcsh:TA1-2040Fuzzy set operationslcsh:Engineering (General). Civil engineering (General)AlgorithmMathematicsFSA-Red Algorithm
researchProduct

An Algorithm for Discretization of Real Value Attributes Based on Interval Similarity

2013

Discretization algorithm for real value attributes is of very important uses in many areas such as intelligence and machine learning. The algorithms related to Chi2 algorithm (includes modified Chi2 algorithm and extended Chi2 algorithm) are famous discretization algorithm exploiting the technique of probability and statistics. In this paper the algorithms are analyzed, and their drawback is pointed. Based on the analysis a new modified algorithm based on interval similarity is proposed. The new algorithm defines an interval similarity function which is regarded as a new merging standard in the process of discretization. At the same time, two important parameters (condition parameterαand ti…

VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413Weighted Majority AlgorithmDiscretizationArticle Subjectlcsh:MathematicsApplied MathematicsPopulation-based incremental learningFunction (mathematics)Interval (mathematics)lcsh:QA1-939Ramer–Douglas–Peucker algorithmsupport vector machineAlgorithmchi2 algorithmMathematicsFSA-Red AlgorithmDiscretization of continuous features
researchProduct